Local conditioning in Bayesian networks
نویسندگان
چکیده
منابع مشابه
Local Conditioning in Bayesian Networks
Local conditioning (LC) is an exact algorithm for computing probability in Bayesian networks, developed as an extension of Kim and Pearl’s algorithm for singly-connected networks. A list of variables associated to each node guarantees that only the nodes inside a loop are conditioned on the variable which breaks it. The main advantage of this algorithm is that it computes the probability direct...
متن کاملInitialization for the Method of Conditioning in Bayesian Belief Networks
Suermondt, H.J. and G.F. Cooper, Initialization for the method of conditioning in Bayesian belief networks (Research Note), Artificial Intelligence 50 (1991) 83-94. The method of conditioning allows us to use Pearl's probabilistic-inference algorithm in multiply connected belief networks by instantiating a subset of the nodes in the network, the loop cutset. To use the method of conditioning, w...
متن کاملConditioning Graphs: Practical Structures for Inference in Bayesian Networks
Probability is a useful tool for reasoning when faced with uncertainty. Bayesian networks offer a compact representation of a probabilistic problem, exploiting independence amongst variables that allows a factorization of the joint probability into much smaller local probability distributions. The standard approach to probabilistic inference in Bayesian networks is to compile the graph into a j...
متن کاملLocal Structure Discovery in Bayesian Networks
Learning a Bayesian network structure from data is an NP-hard problem and thus exact algorithms are feasible only for small data sets. Therefore, network structures for larger networks are usually learned with various heuristics. Another approach to scaling up the structure learning is local learning. In local learning, the modeler has one or more target variables that are of special interest; ...
متن کاملLocal Propagation in Conditional Gaussian Bayesian Networks
This paper describes a scheme for local computation in conditional Gaussian Bayesian networks that combines the approach of Lauritzen and Jensen (2001) with some elements of Shachter and Kenley (1989). Message passing takes place on an elimination tree structure rather than the more compact (and usual) junction tree of cliques. This yields a local computation scheme in which all calculations in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1996
ISSN: 0004-3702
DOI: 10.1016/0004-3702(95)00118-2